A note on the ultimate categorical matching in a graphHSU, Lih-Hsing.Discrete mathematics. 2002, Vol 256, Num 1-2, pp 487-488, issn 0012-365XArticle

The spanning connectivity of line graphsHUANG, Po-Yi; HSU, Lih-Hsing.Applied mathematics letters. 2011, Vol 24, Num 9, pp 1614-1617, issn 0893-9659, 4 p.Article

Spider web networks: a family of optimal, fault tolerant, hamiltonian bipartite graphsKAO, Shin-Shin; HSU, Lih-Hsing.Applied mathematics and computation. 2005, Vol 160, Num 1, pp 269-282, issn 0096-3003, 14 p.Article

Brother trees: A family of optimal 1_p-hamiltonian and 1-edge hamiltonian graphsKAO, Shin-Shin; HSU, Lih-Hsing.Information processing letters. 2003, Vol 86, Num 5, pp 263-269, issn 0020-0190, 7 p.Article

The globally bi-3* and hyper bi-3* connectedness of the spider web networksKAO, Shin-Shin; HSU, Lih-Hsing.Applied mathematics and computation. 2005, Vol 170, Num 1, pp 597-610, issn 0096-3003, 14 p.Article

Edge-bipancyclicity of conditional faulty hypercubesSHIH, Lun-Min; TAN, Jimmy J. M; HSU, Lih-Hsing et al.Information processing letters. 2007, Vol 105, Num 1, pp 20-25, issn 0020-0190, 6 p.Article

Panpositionable hamiltonicity and panconnectivity of the arrangement graphsTENG, Yuan-Hsiang; TAN, Jimmy J. M; HSU, Lih-Hsing et al.Applied mathematics and computation. 2008, Vol 198, Num 1, pp 414-432, issn 0096-3003, 19 p.Article

On the spanning connectivity of graphsLIN, Cheng-Kuan; HUANG, Hua-Min; HSU, Lih-Hsing et al.Discrete mathematics. 2007, Vol 307, Num 2, pp 285-289, issn 0012-365X, 5 p.Article

Optimal 1-edge fault-tolerant designs for laddersCHUANG, Yen-Chu; HSU, Lih-Hsing; CHANG, Chung-Haw et al.Information processing letters. 2002, Vol 84, Num 2, pp 87-92, issn 0020-0190Article

A recursively construction scheme for super fault-tolerant hamiltonian graphsCHEN, Y.-Chuang; HSU, Lih-Hsing; TAN, Jimmy J. M et al.Applied mathematics and computation. 2006, Vol 177, Num 2, pp 465-481, issn 0096-3003, 17 p.Article

Globally bi-3*-connected graphsKAO, Shin-Shin; HSU, Hong-Chun; HSU, Lih-Hsing et al.Discrete mathematics. 2009, Vol 309, Num 8, pp 1931-1946, issn 0012-365X, 16 p.Article

On the construction of combined k-fault-tolerant Hamiltonian graphsHUNG, Chun-Nan; HSU, Lih-Hsing; SUNG, Ting-Yi et al.Networks (New York, NY). 2001, Vol 37, Num 3, pp 165-170, issn 0028-3045Article

On the spanning w-wide diameter of the star graphLIN, Cheng-Kuan; HUANG, Hua-Min; HSU, D. Frank et al.Networks (New York, NY). 2006, Vol 48, Num 4, pp 235-249, issn 0028-3045, 15 p.Article

Cycle embedding in faulty wrapped butterfly graphsTSAI, Chang-Hsiung; TYNE LIANG; HSU, Lih-Hsing et al.Networks (New York, NY). 2003, Vol 42, Num 2, pp 85-96, issn 0028-3045, 12 p.Article

A New Property of Interconnection NetworksSHIH, Yuan-Kang; TAN, Jimmy J. M; HSU, Lih-Hsing et al.Parallel and distributed processing techniques and applications. International conferenceWorldComp'2011. 2011, pp 94-98, isbn 1-60132-193-7 1-60132-194-5 1-60132-195-3, 5 p.Conference Paper

Mutually orthogonal hamiltonian connected graphsHO, Tung-Yang; LIN, Cheng-Kuan; TAN, Jimmy J. M et al.Applied mathematics letters. 2009, Vol 22, Num 9, pp 1429-1431, issn 0893-9659, 3 p.Article

Mutually independent hamiltonian paths in star networksLIN, Cheng-Kuan; HUANG, Hua-Min; HSU, Lih-Hsing et al.Networks (New York, NY). 2005, Vol 46, Num 2, pp 110-117, issn 0028-3045, 8 p.Article

The super laceability of the hypercubesCHANG, Chung-Haw; LIN, Cheng-Kuan; HUANG, Hua-Min et al.Information processing letters. 2004, Vol 92, Num 1, pp 15-21, issn 0020-0190, 7 p.Article

Ring embedding in faulty pancake graphsHUNG, Chun-Nan; HSU, Hong-Chun; LIANG, Kao-Yung et al.Information processing letters. 2003, Vol 86, Num 5, pp 271-275, issn 0020-0190, 5 p.Article

The shuffle-cubes and their generalizationLI, Tseng-Kuei; TAN, Jimmy J. M; HSU, Lih-Hsing et al.Information processing letters. 2001, Vol 77, Num 1, pp 35-41, issn 0020-0190Article

Strong Menger connectivity with conditional faults on the class of hypercube-like networksSHIH, Lun-Min; CHIANG, Chieh-Feng; HSU, Lih-Hsing et al.Information processing letters. 2008, Vol 106, Num 2, pp 64-69, issn 0020-0190, 6 p.Article

Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubesLI, Tseng-Kuei; TSAI, Chang-Hsiung; TAN, Jimmy J. M et al.Information processing letters. 2003, Vol 87, Num 2, pp 107-110, issn 0020-0190, 4 p.Article

The Hyper-Panconnectedness of the Crossed CubeCHEN, Hon-Chan; KUNG, Tzu-Liang; HSU, Lih-Hsing et al.Parallel and distributed processing techniques and applications. International conferenceWorldComp'2011. 2011, pp 123-127, isbn 1-60132-193-7 1-60132-194-5 1-60132-195-3, 5 p.Conference Paper

A family of Hamiltonian and Hamiltonian connected graphs with fault toleranceCHEN, Y-Chuang; HUANG, Yong-Zen; HSU, Lih-Hsing et al.Journal of supercomputing. 2010, Vol 54, Num 2, pp 229-238, issn 0920-8542, 10 p.Article

The Spanning Connectivity of the Burnt Pancake GraphsCHIN, Cherng; WENG, Tien-Hsiung; HSU, Lih-Hsing et al.IEICE transactions on information and systems. 2009, Vol 92, Num 3, pp 389-400, issn 0916-8532, 12 p.Article